翻訳と辞書 Words near each other ・ Sticker hårt ・ Sticker shock ・ Sticker, Cornwall ・ Stickers as a Service ・ Stickets ・ Stickfighting Days ・ Stickfigure Records ・ Stickford ・ Stickhausen Castle ・ Stickies ・ Stickies (papermaking) ・ Stickies (software) ・ Stickin' Around ・ Stickin' to My Guns ・ Sticking ・ Sticking coefficient ・ Sticking Fingers into Sockets ・ Sticking knife ・ Sticking probability ・ Stickis ・ Stickit minister ・ StickK ・ Stickland ・ Stickland fermentation ・ Stickle ・ Stickle Bricks ・ Stickle Pike ・ Stickle Ridge ・ Stickle Tarn, Langdale ・ Stickleback Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Sticking coefficient ： ウィキペディア英語版 Sticking coefficient Sticking coefficient is the term used in surface physics to describe the ratio of the number of adsorbate atoms (or molecules) that adsorb, or "stick", to a surface to the total number of atoms that impinge upon that surface during the same period of time.〔(sticking coefficient ) ''IUPAC Compendium of Chemical Terminology'' 2nd Edition (1997), Accessed 30 September 2008〕 Sometimes the symbol Sc is used to denote this coefficient, and its value is between 1 (all impinging atoms stick) and 0 (no atoms stick). The coefficient is a function of surface temperature, surface coverage (θ) and structural details as well as the kinetic energy of the impinging particles. ==Derivation== When arriving at a site of a surface, an adatom has three options. There is a probability that it will adsorb to the surface ($P\_a$), a probability that it will migrate to another site on the surface ($P\_m$), and a probability that it will desorb from the surface and return to the bulk gas ($P\_d$). For an empty site (θ=0) the sum of these three options is unity. :$P\_a\; +\; P\_m\; +\; P\_d=1$ For a site already occupied by an adatom (θ>0), there is no probability of adsorbing, and so the probabilities sum as: :$P\_d\text{'}+P\_m\text{'}=1$ For the first site visited, the P of migrating overall is the P of migrating if the site is filled plus the P of migrating if the site is empty. The same is true for the P of desorption. The P of adsorption, however, does not exist for an already filled site. :$P\_=P\_m(1-\backslash theta)+P\_m\text{'}(\backslash theta)$ :$P\_=P\_d(1-\backslash theta)+P\_d\text{'}(\backslash theta)$ :$P\_=P\_m(1-\backslash theta)$ The P of migrating from the second site is the P of migrating from the first site ''and then'' migrating from the second site, and so we multiply the two values. :$P\_=P\_\; \backslash times\; P\_=P\_^2$ Thus the sticking probability ($s\_c$) is the P of sticking of the first site, plus the P of migrating from the first site ''and then'' sticking to the second site, plus the P of migrating from the second site ''and then'' sticking at the third site etc. :$s=P\_a(1-\backslash theta)+P\_P\_a(1-\backslash theta)+P\_^2P\_a(1-\backslash theta)...$ :$s=P\_a(1-\backslash theta)\backslash sum\_^\; P\_^n$ There is an identity we can make use of. : :$\backslash therefore\; s=P\_a(1-\backslash theta)\backslash frac=P\_a+P\_d$ :$s\_0=\backslash frac$ :$\backslash frac=\backslash frac$ If we just look at the P of migration at the first site, we see that it is certainty minus all other possibilities. :$P\_m1=1-P\_d(1-\backslash theta)-P\_d\text{'}(\backslash theta)-P\_a(1-\backslash theta)$ Using this result, and rearranging, we find: :$\backslash frac=()^$ :$\backslash frac=()^$ :$K\backslash overset\}\backslash frac$ 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Sticking coefficient」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.